An Auto-validating Rejection Sampler

نویسندگان

  • Raazesh Sainudiin
  • Thomas L. York
چکیده

In Bayesian statistical inference and computationally intensive frequentist inference, one is interested in obtaining samples from a high dimensional, and possibly multi-modal target density. The challenge is to obtain samples from this target without any knowledge of the normalizing constant. Several approaches to this problem rely on Monte Carlo methods. One of the simplest such methods is the rejection sampler due to von Neumann. Here we introduce an auto-validating version of the rejection sampler via interval analysis. We show that our rejection sampler does provide us with independent samples from a large class of target densities in a guaranteed manner. We illustrate the efficiency of the sampler by theory and by examples in up to 10 dimensions. Our sampler is immune to the ‘pathologies’ of some infamous densities including the witch’s hat and can rigorously draw samples from piece-wise Euclidean spaces of small phylogenetic trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Auto-validating Rejection Sampler for Differentiable Arithmetical Expressions: Posterior Sampling of Phylogenetic Quartets

We introduce an efficient extension of a recently introduced auto-validating rejection sampler that is capable of producing independent and identically distributed (IID) samples from a large class of target densities with locally Lipschitz arithmetical expressions. Our extension is restricted to target densities that are differentiable. We use the centered form, as opposed to the natural interv...

متن کامل

An Auto-Validating, Trans-Dimensional, Universal Rejection Sampler for Locally Lipschitz Arithmetical Expressions

We introduce a trans-dimensional extension of the rejection sampler of von Neumann. Our interval analytic construction of the rejection sampler provides a universal method that is capable of producing exact samples from a large class of trans-dimensional target densities with locally Lipschitz arithmetical expressions. We illustrate the efficiency of the sampler by theory and by examples in up ...

متن کامل

On sequential Monte Carlo, partial rejection control and approximate Bayesian computation

We present a sequential Monte Carlo sampler variant of the partial rejection control algorithm introduced by Liu (2001), termed SMC sampler PRC, and show that this variant can be considered under the same framework of the sequential Monte Carlo sampler of Del Moral et al. (2006). We make connections with existing algorithms and theoretical results, and extend some theoretical results to the SMC...

متن کامل

Large-Flip Importance Sampling

We propose a new Monte Carlo algorithm for complex discrete distributions. The algorithm is motivated by the N-Fold Way, which is an ingenious event-driven MCMC sampler that avoids rejection moves at any specific state. The N-Fold Way can however get “trapped” in cycles. We surmount this problem by modifying the sampling process. This correction does introduce bias, but the bias is subsequently...

متن کامل

An iterative Monte Carlo method for nonconjugate Bayesian analysis

The Gibbs sampler has been proposed as a general method for Bayesian calculation in Gelfand and Smith (1990). However, the predominance of experience to date resides in applications assuming conjugacy where implementation is reasonably straightforward. This paper describes a tailored approximate rejection method approach for implementation of the Gibbs sampler when nonconjugate structure is pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006